Robust Pitch Estimation Using l1-regularized Maximum Likelihood Estimation
نویسندگان
چکیده
This paper presents a new method of robust pitch estimation using sparsity-based estimation techniques. The method is developed based on sparse representation of a temporalspectral pitch feature. The robust pitch feature is obtained by accumulating spectral peaks over consecutive frames. It is expressed as a sparse linear combination of an over-complete set of peak spectrum exemplars. The probability distribution of the noise is assumed to be Gaussian with non-zero mean. The weights of the linear combination are estimated by maximizing the likelihood of the feature under sparsity constraint. The sparsity constraint is incorporated as an l1 regularization term. From the estimated weights, the major constituent exemplars are identified and the fundamental frequency is determined. Experimental results show that, with this method, pitch estimation accuracy is significantly improved, particularly at low signal-to-noise ratios.
منابع مشابه
Regularized maximum likelihood estimation of sparse stochastic monomolecular biochemical reaction networks
A sparse parameter estimation method is proposed for identifying a stochastic monomolecular biochemical reaction network system. Identification of a reaction network can be achieved by estimating a sparse parameter matrix containing the reaction network structure and kinetics information. Stochastic dynamics of a biochemical reaction network system is usually modeled by a chemical master equati...
متن کاملTitle of Document : MAXIMUM LIKELIHOOD PITCH ESTIMATION USING SINUSOIDAL MODELING
Title of Document: MAXIMUM LIKELIHOOD PITCH ESTIMATION USING SINUSOIDAL MODELING Vijay Mahadevan, Master of Science, 2010 Directed By: Dr. Carol Y. Espy-Wilson Department of Electrical and Computer Engineering The aim of the work presented in this thesis is to automatically extract the fundamental frequency of a periodic signal from noisy observations, a task commonly referred to as pitch estim...
متن کاملLearning Sparse Gaussian Graphical Model with l0-regularization
For the problem of learning sparse Gaussian graphical models, it is desirable to obtain both sparse structures as well as good parameter estimates. Classical techniques, such as optimizing the l1-regularized maximum likelihood or Chow-Liu algorithm, either focus on parameter estimation or constrain to specific structure. This paper proposes an alternative that is based on l0-regularized maximum...
متن کاملRobust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling
We consider the problem of estimating self-exciting point process models from limited binary observations, where the history of the process serves as the covariate. We analyze the performance of two classes of estimators: l1-regularized maximum likelihood and greedy estimation for a discrete version of the Hawkes process and characterize the sampling tradeoffs required for stable recovery in th...
متن کاملChange Point Estimation of the Stationary State in Auto Regressive Moving Average Models, Using Maximum Likelihood Estimation and Singular Value Decomposition-based Filtering
In this paper, for the first time, the subject of change point estimation has been utilized in the stationary state of auto regressive moving average (ARMA) (1, 1). In the monitoring phase, in case the features of the question pursue a time series, i.e., ARMA(1,1), on the basis of the maximum likelihood technique, an approach will be developed for the estimation of the stationary state’s change...
متن کامل